POLYTOPES OF LARGE RANK FOR PSLp4, Fqq

نویسنده

  • P. A. BROOKSBANK
چکیده

This paper examines abstract regular polytopes whose automorphism group is the projective special linear group PSLp4,Fqq. For q odd we show that polytopes of rank 4 exist by explicitly constructing PSLp4,Fqq as a string C-group of that rank. On the other hand, we show that no abstract regular polytope exists whose group of automorphisms is PSLp4,F2k q.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypercube Related Polytopes

Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.

متن کامل

On the Chvátal Rank of Polytopes in the 0/1 Cube

Given a polytope P⊆Rn, the Chv atal–Gomory procedure computes iteratively the integer hull PI of P. The Chv atal rank of P is the minimal number of iterations needed to obtain PI . It is always nite, but already the Chv atal rank of polytopes in R can be arbitrarily large. In this paper, we study polytopes in the 0=1 cube, which are of particular interest in combinatorial optimization. We show ...

متن کامل

A construction for non-rank facets of stable set polytopes of webs

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [9,14] and claw-free graphs [8,9]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [10]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far,...

متن کامل

Almost all webs are not rank-perfect

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...

متن کامل

Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank

We provide a complete characterization of all polytopes P ⊆ [0,1]n with empty integer hull whose Gomory-Chvátal rank is n (and, therefore, maximal). In particular, we show that the first GomoryChvátal closure of all these polytopes is identical.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015